A constraint-based approach to satellite scheduling

نویسندگان

  • Joseph C. Pemberton
  • Flavius Galiber
چکیده

Satellite scheduling, like all scheduling, is the problem of mapping tasks (observation, communication, downlink, control maneuvers, etc.) to resources (sensor satellites, relay satellites, ground stations, etc.). Through our work on satellite scheduling problems, we have encountered many different constraints that are particular to the satellite-scheduling domain. In this paper, we will introduce the satellite mission-operation scheduling problem, describing the problem constraints that are particular to satellite scheduling, and then present the constraint-based techniques that we have used to address these problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Agent-based approach for cooperative scheduling

This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...

متن کامل

A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

متن کامل

Agile Satellite Scheduling via Permutation Search with Constraint Propagation

Earth Observation Satellite (EOS) scheduling is an important oversubscribed constraint optimization problem. Permutation-based scheduling methods have recently been shown to be effective on these problems. However, the new agile EOS satellites present additional scheduling complexity because they allow image acquisition over a window of possible observation times. Constraint propagation algorit...

متن کامل

Scheduling security constraint unit commitment for power system including stochastic wind power generation

This paper introduces a new approach for scheduling security constraint unit commitment (SCUC) including wind farms. Because of uncertainty in wind power production, we tried to develop a new method for incorporating wind power generation in power plant scheduling. For this, wind power generation modeled with unit commitment in a non-linear optimization problem and simulated by submitting diffe...

متن کامل

Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem

The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998